Stability Properties of Empirical Risk Minimization over Donsker Classes

نویسندگان

  • Andrea Caponnetto
  • Alexander Rakhlin
چکیده

2 ) converges to zero in probability. Hence, even in the case of multiple minimizers of expected error, as n increases it becomes less and less likely that adding a sample (or a number of samples) to the training set will result in a large jump to a new hypothesis. Moreover, under some assumptions on the entropy of the class, along with an assumption of Komlos-Major-Tusnady type, we derive a power rate of decay for the diameter of almost-minimizers. This rate, through an application of a uniform ratio limit inequality, is shown to govern the closeness of the expected errors of the almost-minimizers. In fact, under the above assumptions, the expected errors of almost-minimizers become closer with a rate strictly faster than n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of Empirical Processes in Learning Theory: Algorithmic Stability and Generalization Bounds

This thesis studies two key properties of learning algorithms: their generalization ability and their stability with respect to perturbations. To analyze these properties, we focus on concentration inequalities and tools from empirical process theory. We obtain theoretical results and demonstrate their applications to machine learning. First, we show how various notions of stability upperand lo...

متن کامل

Some Properties of Empirical Risk Minimization Over Donsker Classes

We study properties of algorithms which minimize (or almost-minimize) empirical error over a Donsker class of functions. We show that the L2-diameter of the set of almost-minimizers is converging to zero in probability. Therefore, as the number of samples grows, it is becoming unlikely that adding a point (or a number of points) to the training set will result in a large jump (in L2 distance) t...

متن کامل

Computer Science and Artificial Intelligence Laboratory Some Properties of Empirical Risk Minimization Over Donsker Classes

We study properties of algorithms which minimize (or almost-minimize) empirical error over a Donsker class of functions. We show that the L2-diameter of the set of almost-minimizers is converging to zero in probability. Therefore, as the number of samples grows, it is becoming unlikely that adding a point (or a number of points) to the training set will result in a large jump (in L2 distance) t...

متن کامل

Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems

A number of problems in nonparametric statistics and learning theory can be formulated as penalized empirical risk minimization over large function classes with penalties depending on the complexity of the functions (decision rules) involved in the problem. The goal of mathematical analysis of such procedures is to prove ”oracle inequalities” describing optimality properties of penalized empiri...

متن کامل

Random processes via the combinatorial dimension: introductory notes

This is an informal discussion on one of the basic problems in the theory of empirical processes, addressed in our preprint ”Combinatorics of random processes and sections of convex bodies”, which is available at ArXiV and from our web pages. Arguably, the central problem of the theory of empirical processes is the following: Describe the classes of functions on which the classical limit theore...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Machine Learning Research

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2006